Belief contraction and erasure in fragments of propositional logic
نویسندگان
چکیده
Abstract Recently, belief change within the framework of fragments propositional logic has gained attention. In context revision, it been proposed to refine existing operators so that they operate and result revision remains in fragment under consideration. Later, this notion refinement was generalized operators. Whereas allowed one define concrete rational adapted update, be specified for contraction erasure. We propose a specific erasure operators, called reasonable refinement. This allows us provide refined satisfy basic postulates. study logical properties two model-based Our approach is not limited Horn but applicable many logic, like Krom affine fragments.
منابع مشابه
Belief Revision within Fragments of Propositional Logic
Belief revision has been extensively studied in the framework of propositional logic, but just recently revision within fragments of propositional logic has gained attention. Hereby it is not only the belief set and the revision formula which are given within a certain language fragment, but also the result of the revision has to be located in the same fragment. So far, research in this directi...
متن کاملDeviation in Belief Change on Fragments of Propositional Logic
It is known that prominent fragments of propositional logic are not closed under standard belief change operators. That is, applying such operators to knowledge bases in a fragment may produce results that have no equivalent in the same language. However, the potential range of such a deviation has not been investigated yet. In this paper, we give a systematic study of this problem by consideri...
متن کاملContraction in Propositional Logic
The AGM model for the revision and contraction of belief sets provides rationality postulates for each of the two cases. In the context of finite propositional logic, Katsuno and Mendelzon pointed out postulates for the revision of belief bases which correspond to the AGM postulates for the revision of beliefs sets. In this paper, we present postulates for the contraction of propositional belie...
متن کاملInterpolation in Fragments of Intuitionistic Propositional Logic
Let NNIL (No Nestings of Implication to the Left) be the fragment of IpL (intuitionistic propositional logic) in which the antecedent of any implication is always prime. The following strong interpolation theorem is proved: if IpL }-A+B and A or B is in NNIL, then there is an interpolant I in KNIT The proof consists in constructing I from a proof of A+B in a sequent calculus system by means of ...
متن کاملOn Quasivariety Semantics of Fragments of Intuitionistic Propositional Logic without Exchange and Contraction Rules
A b s t r a c t. Let H be the Hilbert-style intuitionistic propositional calculus without exchange and contraction rules (as given by Ono and Komori). An axiomatization of H with the separation property is provided. Of the superimplicational fragments of H, it is proved that just two fail to be finitely axiomatized, and that all are algebraizable. The paper is a study of these fragments, their ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logic and Computation
سال: 2022
ISSN: ['1465-363X', '0955-792X']
DOI: https://doi.org/10.1093/logcom/exac005